Scale-Free Random SAT Instances
نویسندگان
چکیده
We focus on the random generation of SAT instances that have properties similar to real-world instances. It is known many industrial instances, even with a great number variables, can be solved by clever solver in reasonable amount time. This not possible, general, classical randomly generated provide different model called \emph{scale-free instances}. based use non-uniform probability distribution $P(i)\sim i^{-\beta}$ select variable $i$, where $\beta$ parameter model. results into formulas occurrences $k$ variables follows power-law $P(k)\sim k^{-\delta}$ $\delta = 1 + 1/\beta$. property has been observed most For $\beta=0$, our extends prove existence SAT-UNSAT phase transition phenomenon for scale-free 2-SAT $\beta<1/2$ when clause/variable ratio $m/n=\frac{1-2\beta}{(1-\beta)^2}$. also k-SAT are unsatisfiable high clauses exceeds $\omega(n^{(1-\beta)k})$. %This implies SAT/UNSAT phenomena vanishes $\beta>1-1/k$, and due small core clauses. The proof this result suggests that, unsatisfiability may cores Finally, we show how will allow us generate interest testing purposes.
منابع مشابه
Locality in Random SAT Instances
Despite the success of CDCL SAT solvers solving industrial problems, there are still many open questions to explain such success. In this context, the generation of random SAT instances having computational properties more similar to realworld problems becomes crucial. Such generators are possibly the best tool to analyze families of instances and solvers behaviors on them. In this paper, we pr...
متن کاملRandom SAT Instances à la Carte
Many studies focus on the generation of hard SAT instances. The hardness is usually measured by the time it takes SAT solvers to solve the instances. In this preliminary study, we focus on the generation of instances that have computational properties that are more similar to realworld instances. In particular, instances with the same degree of difficulty, measured in terms of the tree-like res...
متن کاملA Modularity-Based Random SAT Instances Generator
Nowadays, many industrial SAT instances can be solved efficiently by modern SAT solvers. However, the number of real-world instances is finite. Therefore, the process of development and test of SAT solving techniques can benefit of new models of random formulas that capture more realistically the features of real-world problems. In many works, the structure of industrial instances has been anal...
متن کاملTowards Industrial-Like Random SAT Instances
We focus on the random generation of SAT instances that have computational properties that are similar to real-world instances. It is known that industrial instances, even with a great number of variables, can be solved by a clever solver in a reasonable amount of time. This is not possible, in general, with classical randomly generated instances. We provide different generation models of SAT i...
متن کاملRandom SAT Instances à la Carte 1
Many studies focus on the generation of hard SAT instances. The hardness is usually measured by the time it takes SAT solvers to solve the instances. In this preliminary study, we focus on the generation of instances that have computational properties that are more similar to real-world instances. In particular, instances with the same degree of difficulty, measured in terms of the tree-like re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2022
ISSN: ['1999-4893']
DOI: https://doi.org/10.3390/a15060219